Twelfth Power Qualified Residue Difference Sets
نویسنده
چکیده
Qualified residue difference sets of power n are known to exist for n = 2, 4, 6, as do similar sets that include the zero element, while both classes of set are known to be nonexistent for n = 8 and n = 10. Both classes of set are proved nonexistent for n = 12.
منابع مشابه
Nonexistence of twenty-fourth power residue addition sets
Let n > 1 be an integer, and let Fp denote a field of p elements for a prime p ≡ 1 (mod n). By 2015, the question of existence or nonexistence of n-th power residue difference sets in Fp had been settled for all n < 24. We settle the case n = 24 by proving the nonexistence of 24-th power residue difference sets in Fp. We also prove the nonexistence of qualified 24-th power residue difference se...
متن کاملQualified Difference Sets from Unions of Cyclotomic Classes
Qualified difference sets (QDS) composed of unions of cyclotomic classes are discussed. An exhaustive computer search for such QDS and modified QDS that also possess the zero residue has been conducted for all powers n = 4, 6, 8 and 10. Two new families were discovered in the case n = 8 and some new isolated systems were discovered for n = 6 and n = 10. 2000 Mathematics subject classification: ...
متن کامل7 J ul 1 99 8 GAUSS SUMS , JACOBI SUMS , AND p - RANKS OF CYCLIC DIFFERENCE SETS
We study quadratic residue difference sets, GMW difference sets, and difference sets arising from monomial hyperovals, all of which are (2d−1, 2d−1−1, 2d−2−1) cyclic difference sets in the finite field F2d of 2 d elements, with d ≥ 2. We show that, except for a few cases with small d, these difference sets are all pairwise inequivalent. This is accomplished in part by examining their 2-ranks. T...
متن کامل2 8 A ug 1 99 8 GAUSS SUMS , JACOBI SUMS , AND p - RANKS OF CYCLIC DIFFERENCE SETS
We study quadratic residue difference sets, GMW difference sets, and difference sets arising from monomial hyperovals, all of which are (2d−1, 2d−1−1, 2d−2−1) cyclic difference sets in the multiplicative group of the finite field F2d of 2 d elements, with d ≥ 2. We show that, except for a few cases with small d, these difference sets are all pairwise inequivalent. This is accomplished in part b...
متن کاملComplexity of universal access structures
An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, namely the one in which there are one or more participants in every possible Boolean combination of the minimal qualified sets. Every access structure is a substructure of the universal structure for the same number of mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009